A false compatibility

Stimulus-Response Compatibility Is Information-Action Compatibility

Pairwise Compatibility Graphs: A Survey

A graph G = (V, E) is a pairwise compatibility graph (PCG) if there exists an edgeweighted tree T and two nonnegative real numbers dmin and dmax such that each leaf u of T is a node of V and there is an edge (u, v) ∈ E if and only if dmin ≤ dT (u, v) ≤ dmax, where dT (u, v) is the sum of weights of the edges on the unique path from u to v in T . In this article, we survey the state of the art c...

ON THE COMPATIBILITY OF A CRISP RELATION WITH A FUZZY EQUIVALENCE RELATION

In a recent paper, De Baets et al. have characterized the fuzzytolerance and fuzzy equivalence relations that a given strict order relation iscompatible with. In this paper, we generalize this characterization by consideringan arbitrary (crisp) relation instead of a strict order relation, while payingattention to the particular cases of a reflexive or irreflexive relation. The reasoninglargely ...

False Consensus About False Consensus

Research on human reasoning is dominated by demonstrations of the errors people make in various judgment and decision-making tasks. The area of social cognition is not an exception: the list of apparent errors is long and includes a number of contradictory phenomena. Here we explore a prominent example of the contradictory pairs of biases: false consensus and false uniqueness. We show in an emp...

5.2 Compatibility

27 In MultiContext systems, these compatibility relations are formalized as a special kind of inference rules, called bridge rules 11. The form of a bridge rule is the following: (12) where c i and c j are contexts and 1 ; : : :; n are formulae belonging to the language of c i and n+1 is a formula belonging to the language of c j. Semantically, the eeect of a rule like this is to put a constrai...